Generalized Rational Chebyshev Approximation
نویسندگان
چکیده
In this paper, a generalized rational Chebyshev approximation problem is considered. The problem is this: To minimize the maximum absolute value of the "criterion function" of the error. By imposing a rather natural restriction on the criterion function, the problem is solved completely; the existence, the uniqueness and the characterization of the best approximation are clarified and interesting relationships between the best approximations corresponding to different criterion functions are found. The theory is applied to the starting rational approximation for Newton iteration for xl/n.
منابع مشابه
An improved pseudospectral approximation of generalized Burger-Huxley and Fitzhugh-Nagumo equations
In this research paper, an improved Chebyshev-Gauss-Lobatto pseudospectral approximation of nonlinear Burger-Huxley and Fitzhugh- Nagumo equations have been presented. The method employs chebyshev Gauss-Labatto points in time and space to obtain spectral accuracy. The mapping has introduced and transformed the initial-boundary value non-homogeneous problem to homogeneous problem. The main probl...
متن کاملThe best uniform polynomial approximation of two classes of rational functions
In this paper we obtain the explicit form of the best uniform polynomial approximations out of Pn of two classes of rational functions using properties of Chebyshev polynomials. In this way we present some new theorems and lemmas. Some examples will be given to support the results.
متن کاملA rational Chebyshev functions approach for Fredholm-Volterra integro-differential equations
The purpose of this study is to present an approximate numerical method for solving high order linear Fredholm-Volterra integro-differential equations in terms of rational Chebyshev functions under the mixed conditions. The method is based on the approximation by the truncated rational Chebyshev series. Finally, the effectiveness of the method is illustrated in several numerical examples. The p...
متن کاملRecursive Synthesis of Linear Time-Variant Digital Filters via Chebyshev Approximation
Ahstracr -The present paper investigates the recursive realization of a rational generalized transfer function (GTF) as a linear time-variant (LTV) difference equation. We develop a relationship between a GTF and a time-variant difference equation. The unique realizability of a GTF as a LTV difference equation is discussed. Procedures for determining a timevariant difference equation from a giv...
متن کاملGeneralized Chebyshev polynomials of the second kind
We characterize the generalized Chebyshev polynomials of the second kind (Chebyshev-II), and then we provide a closed form of the generalized Chebyshev-II polynomials using the Bernstein basis. These polynomials can be used to describe the approximation of continuous functions by Chebyshev interpolation and Chebyshev series and how to efficiently compute such approximations. We conclude the pap...
متن کامل